Trade-offs across Space, Time, and Ecosystem Services

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ecosystem service trade-offs across global contexts and scales

Meeting human needs while sustaining the planet’s life support systems is the fundamental challenge of our time. What role sustenance of biodiversity and contrasting ecosystem services should play in achieving a sustainable future varies along philosophical, cultural, institutional, societal, and governmental divisions. Contrasting biophysical constraints and perspectives on human well-being ar...

متن کامل

A sustainability framework for assessing trade-offs in ecosystem services

Achieving sustainability, i.e., meeting the needs of current populations without compromising the needs of future generations, is the major challenge facing global society in the 21st century. Navigating the inherent trade-offs between provisioning, regulating, cultural, and supporting ecosystem services, and doing so in a way that does not compromise natural capital needed to provide services ...

متن کامل

Trade-Offs between Ecosystem Services in a Mountain Region

Mountain ecosystems provide a broad range of ecosystem services (ES). Trade-offs between different ES are an important aspect in the assessment of future sustainable land-use. Management of ES in mountain regions must confront the challenges of spatial and temporal heterogeneity, and interaction with structural changes in agriculture and forestry. Using a social-ecological modeling framework, w...

متن کامل

Time-space Trade-offs for Voronoi Diagrams

Let S be a planar n-point set. Classically, one can find the Voronoi diagram VD(S) for S in O(n log n) time and O(n) space. We study the situation when the available workspace is limited: for s ∈ {1, . . . , n}, an s-workspace algorithm has read-only access to an input array with the points from S in arbitrary order, and it may use only O(s) additional words of Θ(log n) bits for reading and wri...

متن کامل

Optimal Time-Space Trade-Offs for Sorting

We study the fundamental problem of sorting in a sequential model of computation and in particular consider the time-space trade-off (product of time and space) for this problem. Beame has shown a lower bound of Ω(n) for this product leaving a gap of a logarithmic factor up to the previously best known upper bound of O(n log n) due to Frederickson. Since then, no progress has been made towards ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ecology and Society

سال: 2006

ISSN: 1708-3087

DOI: 10.5751/es-01667-110128